#include<iostream>
using namespace std;
typedef class huffmantree {
public:
	int parent;
	int lchild, rchild;
}*huffman;
#define huffmancode char**
void Createhuffmantree(huffman& t, huffmancode& p, int n) {
	p = new char* [n + 1];
	char* cd;
	cd = new char[n];
	cd[n - 1] = '\0';
	for (int i = 1; i <= n; i++) {
		int start = n - 1;
		int c = i;
		int f = t[i].parent;
		while (f != 0) {
			start--;
			if (t[f].lchild == c) {
				cd[start] = '0';
			}
			else {
				cd[start] = '1';
			}
			c = f; f = t[f].parent;
		}
		p[i] = new char[n - start];
		strcpy(p[i], &cd[start]);
	}
	delete[]cd;
}
int main() {
	int n = 0;
	cin >> n;
	huffman p = new huffmantree[n];

	system("pause");
	return 0;
}